北京邮电大学学报

  • EI核心期刊

北京邮电大学学报 ›› 2006, Vol. 29 ›› Issue (s2): 105-109.doi: 10.13190/jbupt.2006s2.105.yangj

• 论文 • 上一篇    下一篇

一种实现区分服务和带宽公平性的队列管理算法

杨 洁, 望育梅, 雷振明   

  1. 北京邮电大学 信息工程学院, 北京 100876
  • 收稿日期:2006-09-01 修回日期:1900-01-01 出版日期:2006-11-30 发布日期:2006-11-30
  • 通讯作者: 杨 洁

A Novel Queue Management Algorithm for
Achieving Traffic Differentiation and Bandwidth Fairness

YANG Jie, WANG Yu-mei, LEI Zhen-ming   

  1. School of Information Engineering, Beijing University of Posts and Telecommunications, Beijing 100876,China
  • Received:2006-09-01 Revised:1900-01-01 Online:2006-11-30 Published:2006-11-30
  • Contact: YANG Jie

摘要:

区分服务(DiffServ)体系对于可靠型(AF)服务的OUT数据包和尽力型(BE)服务的数据包并未提供任何优先处理机制。为避免某AF服务的数据流占用过多的网络带宽,提出了一种名为TD&BF的核心无状态队列管理算法,该算法能在保证AF业务承诺服务速率的前提下,将剩余带宽公平地分配给BE业务及AF业务。

关键词: 区分服务, 可靠型, 尽力型, 承诺服务速率

Abstract:

The differentiated service (DiffServ) architecture does not specify any scheme of priority between assured forwarding (AF) out-profile packets and best effort (BE) packets. In order to avoid misbehaving AF flows occupying excessive bandwidth, a simple core-stateless queue management scheme, named TD&BF, was proposed, which not only guarantees the committed rates of AF flows but also fairly allocates remained bandwidth between the BE and AF flows. Analysis and simulation results showed that the proposed scheme was highly effective and efficient.

Key words: differentiated service;assured forwarding;best effort, committed rate

中图分类号: